Some sequences of integers
نویسنده
چکیده
What I want to describe is a kind of experimental mathematics, ideal for doing at times when honest thinking is not going well. The requirements are a small computer (pencil and paper suffice, though the calculations are tedious), and Neil Sloane’s “A Handbook of Integer Sequences” [15]. This book, a kind of hitch-hikers’ guide to the universe N”, consists mainly of a list of 2372 sequences of nonnegative integers, arranged lexicographically, with an index, references, and notes for users. The main criterion for inclusion of a sequence is that somebody must have found it sufficiently interesting to record it in the literature. The Handbook can be used, then, like a book of tables, using the index to locate a sequence. A more exciting possibility is this. Suppose you find youself in possession of an “unknown” sequence. (This is not an uncommon event; a glance through the Handbook confirms that sequences occur in all provinces of mathematics, and well beyond its frontiers.) If you can locate your sequence in the Handbook, you have both a problem (of showing that your sequence really is the one listed) and a source of information (the references to the sequence). I know of several cases where new results have been discovered this way. I propose a third way of using the Handbook. There are some naturallyoccurring transformations of sequences, two of which I will consider in detail. Finding instances where a known sequence is transformed into another can give rise to new mathematical insights in the way described above. Also any sequence which is transfirmed into a closely-related one gains significance independent of the objects it counts. Sloane adops the convection that all sequences commence 1, IZ, when n > 1. To ensure this, he deletes “superfluous” leading ones and zeros, and inserts a 1 if necessary. Some valuable information is lost in this way, namely the “natural” starting point of the sequence. But, on the positive side, the weakness of the
منابع مشابه
Non-Abelian Sequenceable Groups Involving ?-Covers
A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...
متن کاملThe Arithmetic of Realizable Sequences
In this thesis we consider sequences of non-negative integers which arise from counting the periodic points of a map T : X → X, where X is a non-empty set. Some of the main results obtained are concerned with the counting of the periodic points of an endomorphism of a group, in particular when the group is locally nilpotent, for which class of groups a local-global property is established. The ...
متن کاملProfinite automata
Many sequences of p-adic integers project modulo p to p-automatic sequences for every α ≥ 0. Examples include algebraic sequences of integers, which satisfy this property for every prime p, and some cocycle sequences, which we show satisfy this property for a fixed p. For such a sequence, we construct a profinite automaton that projects modulo p to the automaton generating the projected sequenc...
متن کاملSkolem Sequences and Erdosian Labellings of m Paths with 2 and 3 Vertices
Assume that we have m identical graphs where the graphs consists of paths with k vertices where k is a positive integer. In this paper, we discuss certain labelling of the m graphs called c-Erdösian for some positive integers c. We regard labellings of the vertices of the graphs by positive integers, which induce the edge labels for the paths as the sum of the two incident vertex labels. They h...
متن کاملA 38 Integers 15 ( 2015 ) Polynomial Sequences on Quadratic Curves
In this paper we generalize the study of Matiyasevich on integer points over conics, introducing the more general concept of radical points. With this generalization we are able to solve in positive integers some Diophantine equations, relating these solutions by means of particular linear recurrence sequences. We point out interesting relationships between these sequences and known sequences i...
متن کاملComplete sequences of sets of integer powers
Call S complete if Σ(S) contains all sufficiently large integers. It has been known for some time (see [B]) that if gcd(a, b) = 1 then the (nondecreasing) sequence formed from the values ab with s0 ≤ s, t0 ≤ t ≤ f(s0, t0) is complete, where s0 and t0 are arbitrary, and f(s0, t0) is sufficiently large. In this note we consider the analogous question for sequences formed from pure powers of integ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 75 شماره
صفحات -
تاریخ انتشار 1989